Range Searching Over Tree Cross Products
نویسندگان
چکیده
We introduce the tree cross-product problem, which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.
منابع مشابه
Dynamic Tree Cross Products
Range searching over tree cross products is a variant of classic range searching, recently introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, pp. 120–131, 2000). A tree cross product consist of hyperedges connecting the nodes of trees T1, . . . , Td. In this context, range searching means to determine all hyperedges connecting a given set of tree nodes. Buchsbaum et al. describe ...
متن کاملUpdate on HCV genotypes among Iranian blood donors
Abstract Background and Objectives Hepatitis C (HCV) infection is one of the main causes of chronic hepatitis diseases all over the world. HCV is a transfusion transmitted virus and a serious threat to general health. HCV genotyping has an important role in tracing routes of infection. This study aimed at investigating the changes in distribution pattern of HCV genotypes among Iranian blood d...
متن کاملEfficient visual navigation of hierarchically structured graphs
Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierarchical structure. This structure is expressed in form of a recursive clustering of the nodes: in call graphs of telephone networks, for instance, the nodes are identified with phone numbers; they are clustered recursively through the implicit structure o...
متن کاملA Neuro-Fuzzy Algorithm for Modeling of Fischer-Tropsch Synthesis over a Bimetallic Co/Ni/Al2O3 Catalyst
An alumina supported Co/Ni catalyst was prepared by sol-gel procedure to study the catalytic behavior during Fischer-Tropsch synthesis in a fixed-bed reactor. The effect of CO conversion (10-50%) on hydrocarbon product distribution (CH4, C5+ and C2-C4 olefin selectivities) was studied. Selectivity for CH4 decreased, while those of C5+<...
متن کاملEfficient Spatial Indexes for Approximate Range Searching
Building efficient spatial indexes for range searching is a central problem in spatial databases. The R-tree has been a popular spatial index thanks to its simplicity, ability to answer various queries, and the flexibility to store spatial objects of different shapes. However, the R-tree is known to be a heuristic-based structure and no guarantees can be made on its query performance. In this p...
متن کامل